Nucleation scaling in jigsaw percolation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nucleation versus percolation: Scaling criterion for failure in disordered solids.

One of the major factors governing the mode of failure in disordered solids is the effective range R over which the stress field is modified following a local rupture event. In a random fiber bundle model, considered as a prototype of disordered solids, we show that the failure mode is nucleation dominated in the large system size limit, as long as R scales slower than L(ζ), with ζ=2/3. For a f...

متن کامل

Jigsaw Percolation on Erdös-rényi Random Graphs

We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erdös-Rényi random graphs. Let pppl and ppuz denote the probability that an edge exists in the respective people and puzzle graphs and define peff = ppplppuz, the effective probability. We show for constants c1 > 1 and c2 > π /6 and c3 < e −5 if min(pppl, ppuz) > c1 logn/n the critical ef...

متن کامل

THE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL

The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...

متن کامل

Finite-Size Scaling in Percolation

This work is a detailed study of the phase transition in percolation, in particular of the question of finite-size scaling: Namely, how does the critical transition behavior emerge from the behavior of large, finite systems? Our results rigorously locate the proper window in which to do critical computation and establish features of the phase transition. This work is a finite-dimensional analog...

متن کامل

Jigsaw percolation: What social networks can collaboratively solve a puzzle?

We introduce a new kind of percolation on finite graphs called jigsaw percolation. This model attempts to capture networks of people who innovate by merging ideas and who solve problems by piecing together solutions. Each person in a social network has a unique piece of a jigsaw puzzle. Acquainted people with compatible puzzle pieces merge their puzzle pieces. More generally, groups of people w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 2017

ISSN: 1050-5164

DOI: 10.1214/16-aap1206